Choosing the unique labeled graph as the object , two new algorithms , ma - tricon and sfp , are proposed 論文首先選擇唯一標號圖作為研究的突破口,先后提出了matricon和sfp算法。
It is based on the fact that unique labeled graph can be transformed into the format of itemset , on which recent 10 years research on frequent pattern mining can be applied 由于唯一標號圖能轉換為項集的形式,這就能充分利用近10年來的研究成果。唯一不同的地方是在連通性上的進一步考慮。
The adjacent matrix graph presentation in matricon and vertex - overlapping connectivity determination are the essential tools in the next work on un - unique labeled graph mining Matricon算法中利用關聯矩陣形式代表圖的方法和sfp算法中利用頂點重疊判連通性的思想在下一步非唯一標號圖的分析中也是一個重要工具。